Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
نویسندگان
چکیده
منابع مشابه
Separating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملRedundancy-Related Bounds on Generalized Huffman Codes
This paper presents new lower and upper bounds for the compression rate of optimal binary prefix codes on memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum (arithmetic) average redundancy coding — Huffman coding — these are in terms of a form of entropy and/or the probability of the most probable input symbol. Th...
متن کاملBounds on separating redundancy
It is known that any linear code allows for a decoding strategy that treats errors and erasures separately over an error-erasure channel. In particular, a carefully designed paritycheck matrix makes efficient erasure correction possible through iterative decoding while instantly providing the necessary paritycheck equations for independent error correction on demand. The separating redundancy o...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn Lower Bounds for the Redundancy of Optimal Codes
The problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary codes for the case when the most or the least likely source letter probabilities are known. In this paper we analyze the relationships among tight l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2871477